Coherence Checking of Coercions in Plastic
نویسنده
چکیده
Coercive Subtyping is a conceptually simple but powerful framework for subtyping in type theory. Recent work in Durham by Luo et al. on Coercive Subtyping has been partially implemented in the proof assistant`Plastic'. Plastic is an implementation of a variant of Martin-LL of's LF with inductive types, universes, and coercive subtyping. After discussing background theory and then the implementation of coercions, this paper considers the important issue of coherence. Where several coercions are applicable, coherence will guarantee that the computational result is the same in all cases. Checking coherence is a diicult problem for implementations. Previous implementations have tackled this problem by imposing restrictions on the coercions that may be used, which also limits the power of coercions, eg making them harder to use with deenitions. This paper considers ways around the problem in a less restricted setting. One possibility is to only check coherence of the coercions actually used, rather than trying to check it globally over all possible coercions whether they are used or not; this technique we call \dynamic coherence checking".
منابع مشابه
2 Dynamically typed lambda calculus
We present an extension of a statically typed language with a special type Dynamic and explicit type tagging and checking operations (coercions). Programs in run-time typed languages are viewed as incomplete programs that are to be completed to well-typed programs by explicitly inserting coercions into them. Such completions are generally not unique. If the meaning of an incomplete program is t...
متن کاملDynamic Typing
We present an extension of a statically typed language with a special type Dynamic and explicit type tagging and checking operations (coercions). Programs in run-time typed languages are viewed as incomplete programs that are to be completed to well-typed programs by explicitly inserting coercions into them. Such completions are generally not unique. If the meaning of an incomplete program is t...
متن کاملOn Coherence in Computer Algebra
Modern computer algebra systems (e. g. AXIOM) support a rich type system including parameterized data types and the possibility of implicit coercions between types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important requirement is that all coercions between two types coincide, a property which is called coherence....
متن کاملThe Delta-calculus: syntax and types
We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs, projections and explicit type coercions. The calculus can be parametrized with different intersection type theories T, e.g. the Coppo-Dezani, the Coppo-Dezani-Salle', the Coppo-Dezani-Venneri and the Barendregt-Coppo-Dezani ones, producing a family of Delta-calculi with related intersection type systems. We pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000